Variable Bit Rate Cont Diagram Approx
نویسندگان
چکیده
In this paper, we present a variable bit rate control method for speech/audio coding, under the constraint that the total bit rate of a super-frame to be a constant. The proposed method uses a trellis diagram for optimizing the overall quality of the super-frame. In order to reduce the computational complexity, the trellis diagram uses approximation by ignoring the encoder memory state between different paths. Simulations on the AMR Wideband show that the proposed variable bit rate control achieves up to 4.3 dB improvements to the constant rate coding in the perceptual weighted SNR.
منابع مشابه
A Full-Fuzzy Rate Controller for Variable Bit Rate Video
In this paper, we propose a new full-fuzzy video ratecontrol algorithm (RCA) for variable bit rate (VBR) videoapplications. The proposed RCA provides high qualitycompressed video with a low degree computational complexity.By controlling the quantization parameter (QP) on a picturebasis, it produces VBR video bit streams. The proposed RCAhas been implemented on the JM H.264/AVC video codec andth...
متن کاملVariable elimination for influence diagrams with super value nodes
In the original formulation of influence diagrams, each model contained exacly one utility node. Tatman and Shachter (1990) introduced the possibility of having super-value nodes that represent the sum or the product of their parents’ utility functions. However the algorithm they proposed for dealing with super-value nodes has two shortcomings: it requires dividing potentials when reversing arc...
متن کاملالگوریتم کنترل نرخ بیت متغیر ویدئو در سطح گروه تصاویر برای استاندارد فشردهسازی H.265
A rate control algorithm at the group of picture (GOP) level is proposed in this paper for variable bit rate applications of the H.265/HEVC video coding standard with buffer constraint. Due to structural changes in the HEVC compared to the previous standards, new rate control algorithms are needed to be designed. In the proposed algorithm, quantization parameter (QP) of each GOP is obtained by ...
متن کاملAn asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
We prove that each OBDD (ordered binary decision diagram) for the middle bit of n-bit integer multiplication with one of the asymptotically best known variable orders, namely the pairwise ascending order x0, y0, . . . , xn−1, yn−1, requires size (2(6/5)n). This is asymptotically optimal due to an upper bound of the same order by Amano and Maruoka (2007).
متن کاملA comparison of two approaches for solving unconstrained influence diagrams
Influence diagrams and decision trees represent the two most common frameworks for specifying and solving decision problems. As modeling languages, both of these frameworks require that the decision analyst specifies all possible sequences of observations and decisions (in influence diagrams, this requirement corresponds to the constraint that the decisions should be temporarily linearly ordere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003